Errata for: "On randomized one-round communication complexity"
نویسندگان
چکیده
منابع مشابه
One-round multi-party communication complexity of distinguishing sums
We consider an instance of the following problem: Parties P1, . . . , Pk each receive an input xi, and a coordinator (distinct from each of these parties) wishes to compute f(x1, . . . , xk) for some predicate f . We are interested in one-round protocols where each party sends a single message to the coordinator; there is no communication between the parties themselves. What is the minimum comm...
متن کاملRound Elimination in Exact Communication Complexity
We study two basic graph parameters, the chromatic number and the orthogonal rank, in the context of classical and quantum exact communication complexity. In particular, we consider two types of communication problems that we call promise equality and list problems. For both of these, it was already known that the one-round classical and one-round quantum complexities are characterized by the c...
متن کاملA direct product theorem for bounded-round public-coin randomized communication complexity
A strong direct product theorem for a problem in a given model of computation states that, in order to compute k instances of the problem, if we provide resource which is less than k times the resource required for computing one instance of the problem with constant success probability, then the probability of correctly computing all the k instances together, is exponentially small in k. In thi...
متن کاملDirect Sum Theorem for Bounded Round Quantum Communication Complexity
We prove a direct sum theorem for bounded round entanglement-assisted quantum communication complexity. To do so, we use the fully quantum definition for information cost and complexity that we recently introduced, and use both the fact that information is a lower bound on communication, and the fact that a direct sum property holds for quantum information complexity. We then give a protocol fo...
متن کاملRandomized Communication Complexity of Approximating Kolmogorov Complexity
The paper [Harry Buhrman, Michal Koucký, Nikolay Vereshchagin. Randomized Individual Communication Complexity. IEEE Conference on Computational Complexity 2008: 321-331] considered communication complexity of the following problem. Alice has a binary string x and Bob a binary string y, both of length n, and they want to compute or approximate Kolmogorov complexity C(x|y) of x conditional to y. ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Complexity
سال: 2001
ISSN: 1016-3328,1420-8954
DOI: 10.1007/s000370100003